Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source
نویسندگان
چکیده
In this paper we design a protocol to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy block source in a device independent setting. The protocol employs Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the block n, containing entropy of at least two bits. Our protocol is robust, it can tolerate devices that malfunction with a probability dropping polynomially in n at the cost of constant increase of the number of devices used. 1998 ACM Subject Classification G.3 Random Number Generation
منابع مشابه
Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions
How can one be certain that the output of an alleged random number generator is indeed random? The mathematical theory of randomness extraction requires two or more independent weak randomness sources for ensuring output quality. To circumvent this fundamental yet hard-to-enforce limit, we formulate precisely a model of extracting randomness from non-interacting and untrusted quantum devices, a...
متن کاملOn the Problem of Local Randomness in Privacy Amplification with an Active Adversary
We study the problem of privacy amplification with an active adversary in the information theoretic setting. In this setting, two parties Alice and Bob start out with a shared n-bit weak random string W , and try to agree on a secret random key R over a public channel fully controlled by an active and unbounded adversary. Typical assumptions are that these two parties have access to local priva...
متن کاملDerandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction
Getting the deterministic complexity closer to the best known randomized complexity is an important goal in algorithms and communication protocols. In this work, we investigate the case where instead of one input, the algorithm/protocol is given multiple inputs sampled independently from an arbitrary unknown distribution. We show that in this case a strong and generic derandomization result can...
متن کاملVariable-Length Extractors: Efficiently Extracting Randomness from Weak Stochastic Processes
The topic of generating random bits from imperfect random sources was studied extensively. Existing work provides solutions that are based on the concept of a fixed-length extractor; namely, an algorithm that gets a fixed number of random bits from a source and generates random bits. Typically, the number of random bits extracted using fixed-length extractors is upperbounded by the min-entropy....
متن کاملDevice-independent Randomness Amplification and Privatization
Randomness is an essential resource in computer science. In most applications perfect, and sometimes private, randomness is needed, while it is not even clear that such a resource exists. It is well known that the tools of classical computer science do not allow us to create perfect and secret randomness from a single weak public source. Quantum physics, on the other hand, allows for such a pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014